Identifying Weak Linear Features with the “Coalescing Shortest Path Image Transform”

Stochastic Shortest Path Problems Under Weak Conditions

In this paper we weaken the conditions under which some of the basic analytical and algorithmic results for finite-state stochastic shortest path problems hold. We provide an analysis under three types of assumptions, under all of which the standard form of policy iteration may fail, and other anomalies may occur. In the first type of assumptions, we require a standard compactness and continuit...

Shortest Path Problem with Gamma Probability Distribution Arc Length

We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.

Parallel Shortest Path Algorithms : Identifying the Factors thatA ect

Shortest path computation is required by a large number of applications such as VLSI, transportation and communication networks. These applications, which often use parallel processing, require an eecient parallel shortest path algorithm. The experimental work related to parallel shortest path algorithms has focused on the development of eecient, parallel label-correcting or label-setting algor...

A Practical Shortest Path Algorithm with Linear Expected Time

TRANSIT Ultrafast Shortest-Path Queries with Linear-Time Preprocessing

We introduce the concept of transit nodes, as a means for preprocessing a road network, with given coordinates for each node and a travel time for each edge, such that point-to-point shortest-path queries can be answered extremely fast. The transit nodes are a set of nodes as small as possible with the property that every shortest path that is non-local in the sense that it covers a certain not...